A Morphing Algorithm for Generating Near Optimal Grids Applications in Computational Medicine
نویسندگان
چکیده
We apply morphing to the problem of generating the initial mesh for nite element simulations This algorithm reduces mesh adaptation time by integrating physical and geometric constraints to provide a near optimal initial mesh We apply this method to large scale bioelectric eld problems involving the complex geometries of the human body
منابع مشابه
A discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملPareto Optimization of Two-element Wing Models with Morphing Flap Using Computational Fluid Dynamics, Grouped Method of Data handling Artificial Neural Networks and Genetic Algorithms
A multi-objective optimization (MOO) of two-element wing models with morphing flap by using computational fluid dynamics (CFD) techniques, artificial neural networks (ANN), and non-dominated sorting genetic algorithms (NSGA II), is performed in this paper. At first, the domain is solved numerically in various two-element wing models with morphing flap using CFD techniques and lift (L) and drag ...
متن کاملارائه روش اصلاح شده کلونی مورچگان جهت حل مسئله مسیریابی وسایل نقلیه به همراه پنجره های زمانی
Vehicle Routing Problem with Time Windows (VRPTW) is an NP-Complete Optimization Problem. Even finding an optimal solution for small size problems is too hard and time-consuming. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with dissimilar demands and time window constraints at minimum cost, without violating the capacity and time wi...
متن کاملTHE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS
Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...
متن کاملNear-Minimum-Time Motion Planning of Manipulators along Specified Path
The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994